Resource Constrained Planning of Multiple Projects with Separable Activities.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Apply Metaheuristic ANGEL to Schedule Multiple Projects with Resource-Constrained and Total Tardy Cost

In this paper the multiple projects resourceconstrained project scheduling problem is considered. Several projects are to be scheduled simultaneously with sharing several kinds of limited resources in this problem. Each project contains non-preemptive and deterministic duration activities which compete limited resources under resources and precedence constraints. Moreover, there are the due dat...

متن کامل

Scheduling resource-constrained projects with a flexible project structure

In projects with a flexible project structure, the activities that have to be scheduled are not completely known beforehand. Instead, scheduling such a project includes the decision whether to carry out particular activities at all. This also effects precedence constraints between the finally implemented activities. However, established model formulations and solution approaches for the resourc...

متن کامل

SIBSC: Separable Identity-Based Signcryption for Resource-Constrained Devices

To provide better overall performance, identity (ID)-based signcryption (IBSC) has been constructed by combining ID-based signature (IBS) and ID-based encryption (IBE) in a secure manner. Undoubtedly, the IBSC fulfills the authentication and the confidentiality by signature and encryption, respectively. All the previously proposed IBSC schemes are inseparable in the sense that the two-layer sig...

متن کامل

Improving Local Search for Resource-Constrained Planning

The need to economize limited resources such as energy, fuel, money, and/or time, is ubiquitous in many of the classical applications of planning. Although planning with resources is a long-standing topic, the progress made in solving such problems has been limited. Relaxation heuristics solve a relaxed planning problem in which all “negative effects” of the operators, such as resource consumpt...

متن کامل

Maximising the Net Present Value of Large Resource-Constrained Projects

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey resource constraints and precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of this problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow). Large industrial applications can require thousa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JSME International Journal Series C

سال: 2001

ISSN: 1344-7653,1347-538X

DOI: 10.1299/jsmec.44.261